The maximal-flow problems, shortest route problems, and minimal spanning tree are three types of network models that can be used to solve various problems. As the names indicate the objectives of these three methods are different. The following is a brief analysis of these three models. The maximal-flow problem focuses on the network that supports the flow of the maximum amount of objects from one point to another point. On the other hand, shortest route problem tries to find out the shortest possible distance through the entire network (Render, 2018).